/**********************************************************************
*  Copyright (c) 2007 - Victor Jacobs - victor.jacobs@gmail.com
*
*  Permission is hereby granted, free of charge, to any person
*  obtaining a copy of this software and associated documentation
*  files (the "Software"), to deal in the Software without
*  restriction, including without limitation the rights to use,
*  copy, modify, merge, publish, distribute, sublicense, and/or sell
*  copies of the Software, and to permit persons to whom the
*  Software is furnished to do so, subject to the following
*  conditions:
*
*  The above copyright notice and this permission notice shall be
*  included in all copies or substantial portions of the Software.
*
*  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
*  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
*  OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
*  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
*  HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
*  WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
*  FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
*  OTHER DEALINGS IN THE SOFTWARE.
**********************************************************************/

using System;
using System.Collections.Generic;
using System.Text;
using Vj.MathLibrary.Matrix;

namespace Vj.GraphLibrary
{
    public class AdjacencyMatrix
    {
        public static MatrixInt GetAdjacencyMatrix(Graph graph)
        {

            MatrixInt adjMatrix = new MatrixInt(graph.Nodes.Count, graph.Nodes.Count);

            for (int i = 0; i < graph.Nodes.Count; i++)
            {
                Node startNode = graph.Nodes[i];
                
                for (int k = 0; k < graph.Nodes[i].Connections.Count; k++)
                {
                    Connection conn = graph.Nodes[i].Connections[k];

                    for (int j = 0; j < graph.Nodes.Count; j++)
                    {
                        if (conn.EndNode == graph.Nodes[j])
                        {
                            adjMatrix[i, j] = 1;
                            adjMatrix[j, i] = 1;
                        }
                    }
                }
            }

            return adjMatrix;

        }
    }
}
